How to obtain lattices from (f, sigma, delta)-codes via a generalization of Construction A
نویسنده
چکیده
We show how cyclic (f, σ, δ)-codes over finite rings canonically induce a Z-lattice in R N. The construction can be viewed as a generalization of the classical Construction A for lattices from linear codes and has applications to coset coding, in particular to wire-tap coding. Previous results for lattices obtained from σ-constacyclic codes by Ducoat and Oggier are obtained as special cases.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملq-ary lattices in the lp norm and a generalization of the Lee metric
q-ary lattices are obtained from linear q-ary codes via the so-called Construction A. We study these lattices in the lp norm in R and the associated q-ary codes in the induced p-Lee metric in Zq . This induced metric extends to 1 ≤ p < ∞ the well-known Lee metric when p = 1. A previous result on lattice decoding in the Lee metric is generalized for p > 1 and the existence of perfect codes in su...
متن کاملTime-Mode Signal Quantization for Use in Sigma-Delta Modulators
The rapid scaling in modern CMOS technology has motivated the researchers to design new analog-to-digital converter (ADC) architectures that can properly work in lower supply voltage. An exchanging the data quantization procedure from the amplitude to the time domain, can be a promising alternative well adapt with the technology scaling. This paper is going to review the recent development in t...
متن کاملOn skew polynomial codes and lattices from quotients of cyclic division algebras
We propose a variation of Construction A of lattices from linear codes defined using the quotient Λ/pΛ of some order Λ inside a cyclic division F -algebra, for p a prime ideal of a number field F . To obtain codes over this quotient, we first give an isomorphism between Λ/pΛ and a ring of skew polynomials. We then discuss definitions and basic properties of skew polynomial codes, which are need...
متن کاملMultilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction D'
Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but also are a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes that can realize these benefits with low complexity is still a challenging problem. In this paper, efficient encoding and decoding algorithms are proposed fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.03787 شماره
صفحات -
تاریخ انتشار 2016